Computable algebra, general theory and theory of computable fields.

Computable Algebra, General Theory and Theory of Computable Fields(1)

Introduction. Abstract algebra is the product of a transition from such concrete systems as the ring of integers or the field of rational numbers to the corresponding, axiomatically defined, abstract systems. In the course of this abstraction process various properties of the concrete system are lost. The field of rational numbers, for example, possesses a natural topology, an ordering, and fur...

Pure Computable Model Theory

2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Introduction History Notation and basic definitions Decidable theories, and computable and decidable models Effective completeness theorem Model completeness and decidability Omitting types and decidability Decidable prime models Computable saturated models and computably saturated models Decidable homogeneous models Vaught's theorem computabl...

Computable Model Theory

Computability theory formalizes the intuitive concepts of computation and information content. Pure computability studies these notions and how they relate to definability in arithmetic and set theory. Applied computability examines other areas of mathematics through the lens of effective processes. Tools from computability can be used to give precise definitions of concepts such as randomness....

Computable model theory

An introduction to computable model theory on groups and fields

We introduce the standard computable-model-theoretic concepts of a computable group and a computable field, and use them to illustrate the sorts of questions about groups and fields which computability theorists investigate. This article is intended for group theorists with some background in algorithmic questions, such as the undecidability of the word problem and the conjugacy problem for fin...